Random based inventive Algorithms are being widely used for optimization. An important category of these Algorithms comes from the idea of physical processes or the behavior of beings. A new method for achieving quasi-optimal solutions related to optimization problems in various sciences is proposed in this paper. The proposed Algorithm for optimizing the orientation game is a series of optimization Algorithms that are formed with the idea of an old game and the Search operators are an arrangement of players. These players are displaced in a certain space, under the influence of the referee's orders. The best position would be achieved by following the game laws. In this paper, the real version of the Algorithm is presented. The optimization results of a set of standard functions confirm the optimal efficiency of the proposed method, as well as the superiority of the proposed method over the other well-known metaheuristic Algorithms.